Design of Partially Replicated Distributed Database Systems with Combination of Total Cost and Workload Balancing

نویسنده

  • Sukkyu Song
چکیده

In partially replicated distributed database systems, the minimization of total time usually attempts to minimize resource consumption and therefore to maximize the system throughput. On the other hand, the minimization of response time may be obtained by having a large number of parallel executions to different sites, requiring a higher resource consumption, which means that the system throughput is reduced. Workload balancing implies the reduction of the average time that queries spend waiting for CPU and I/O service at a network site, but its effect on the performance of partially replicated distributed database systems cannot be isolated from other distributed database design factors. In this research, the total cost refers to the combination of total time and response time. This paper presents a framework for total cost minimization and workload balancing for partially replicated distributed database systems considering important design factors together. The framework incorporates both local processing, including CPU and I/O, and communication costs. To illustrate its suitability, experiments are conducted, and results demonstrate that the proposed framework provides effective partially replicated distributed database design. Keywords— Partially replicated distributed database, Total time, Response time, Workload, Operation (subquery) allocation, Data allocation, Genetic algorithms

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Framework for Design of Partially Replicated Distributed Database Systems with Migration Based Genetic Algorithms

For partially replicated distributed database systems to function efficiently, the data (relations) and operations (subquery) of the database need to be located, judiciously at various sites across the relevant communications network.The problem of allocating relations and operations to the most appropriate sites is a difficult one to solve so that genetic algorithms based on migration are prop...

متن کامل

A New Multi-Objective Model for a Cell Formation Problem Considering Machine Utilization and Alternative Process Routes (RESEARCH NOTE)

This paper presents a novel, multi-objective mixed-integer nonlinear programming (MINLP) model for a cell formation problem (CFP) with alternative means. Due to existing contradiction among objectives, three are considered: 1) Minimizing the total cost consisting of; intercellular movements, purchasing, operation, and maintenance; 2) maximizing the utilization of machines in the system; 3) mini...

متن کامل

JET: Electricity cost-aware dynamic workload management in geographically distributed datacenters

The ever-increasing operational cost of geographically distributed datacenters has become a critical issue for cloud service providers. In order to cut the electricity cost of geographically distributed datacenters, several workload management schemes have been proposed, such as Electricity price-aware InteR-datacenter load balancing (EIR), which reduces the electricity cost of active servers b...

متن کامل

A cost-oriented model for multi-manned assembly line balancing problem

In many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. This type of assembly line is called multi-manned assembly line (MAL). In the classical multi-manned assembly line balancing problem (MALBP) the objective is to minimize the manpower needed to manufacture one product unit. Apart from the manpower, othe...

متن کامل

Cycle Time Reduction and Runtime Rebalancing by Reallocating Dependent Tasks

Business Process Management Systems (BPMS) is a complex information system that provides designing, administrating, and improving the business processes. Task allocation to human resources is one of the most important issues which should be managed more efficiently in BPMS. Task allocation algorithms are defined in order to meet the various policies of organizations. The most important of these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014